Interest Analysis using PageRank and Social Interaction Content

نویسندگان

  • Chung-Chi Huang
  • Lun-Wei Ku
چکیده

We introduce a method for learning to predict reader interest. In our approach, social interaction content and both syntactic and semantic features of words are utilized. The proposed method involves estimating topical interest preferences and determining the informativity between articles and their social content. In interest prediction, we integrate articles’ quality social feedback representing readers’ opinions into articles to get information which may identify readers’ interests. In addition, semantic aware PageRank is used to find reader interest with the help of word interestingness scores. Evaluations show that PageRank benefits from proposed features and interest preferences inferred across articles. Moreover, results conclude that social interaction content and the proposed selection process help to accurately cover more span of reader interest.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Filtering Information with imprecise social criteria: A FOAF-based backlink model

Several current approaches to information filtering in Web search engines implement models that use backlinks as a metric of subjective value that complements information retrieval techniques based on the content of the documents. Nonetheless, these models are somewhat “blind” to the reputation or trustworthiness of the creators of the links. The growing increase in interest in applications of ...

متن کامل

Dynamic PageRank Using Evolving Teleportation

The importance of nodes in a network constantly fluctuates based on changes in the network structure as well as changes in external interest. We propose an evolving teleportation adaptation of the PageRank method to capture how changes in external interest influence the importance of a node. This framework seamlessly generalizes PageRank because the importance of a node will converge to the Pag...

متن کامل

Dynamic Context-Sensitive PageRank for Expertise Mining

Online tools for collaboration and social platforms have become omnipresent in Web-based environments. Interests and skills of people evolve over time depending in performed activities and joint collaborations. We believe that ranking models for recommending experts or collaboration partners should not only rely on profiles or skill information that need to be manually maintained and updated by...

متن کامل

Personalized Recommendation of Twitter Lists using Content and Network Information

Lists in social networks have become popular tools to organize content. This paper proposes a novel framework for recommending lists to users by combining several features that jointly capture their personal interests. Our contribution is of two-fold. First, we develop a ListRec model that leverages the dynamically varying tweet content, the network of twitterers and the popularity of lists to ...

متن کامل

Associated Pagerank: A Content Relevance Weighted Pagerank Algorithm

Pagerank algorithm is a link analysis approach to evaluate the importance of web pages, and there are many techniques to improve the traditional Pagerank algorithm to prevent from the biases of link spamming in recent years. A key challenge for link analysis is to identify the relevance between the original page and the linked page. The importance scores of web pages should rely on the quality ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013